TSTP Solution File: ITP061^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP061^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:06:49 EDT 2024
% Result : Theorem 0.38s 0.63s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 21
% Syntax : Number of formulae : 50 ( 20 unt; 12 typ; 0 def)
% Number of atoms : 66 ( 17 equ; 0 cnn)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 257 ( 28 ~; 16 |; 3 &; 201 @)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 11 ( 11 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 39 !; 1 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_sort2,type,
list_c1059388851t_unit: $tType ).
thf(decl_26,type,
minus_minus_nat: nat > nat > nat ).
thf(decl_27,type,
one_one_nat: nat ).
thf(decl_33,type,
suc: nat > nat ).
thf(decl_34,type,
size_s1406904903t_unit: list_c1059388851t_unit > nat ).
thf(decl_36,type,
ord_less_nat: nat > nat > $o ).
thf(decl_37,type,
ord_less_eq_nat: nat > nat > $o ).
thf(decl_41,type,
occM2: nat ).
thf(decl_43,type,
fe: nat > list_c1059388851t_unit ).
thf(decl_46,type,
index: nat ).
thf(decl_61,type,
esk9_2: nat > nat > nat ).
thf(fact_53_not__less__eq,axiom,
! [X19: nat,X4: nat] :
( ~ ( ord_less_nat @ X19 @ X4 )
<=> ( ord_less_nat @ X4 @ ( suc @ X19 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_53_not__less__eq) ).
thf(fact_200_not__le__imp__less,axiom,
! [X210: nat,X211: nat] :
( ~ ( ord_less_eq_nat @ X210 @ X211 )
=> ( ord_less_nat @ X211 @ X210 ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_200_not__le__imp__less) ).
thf(conj_0,conjecture,
( occM2
= ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',conj_0) ).
thf(fact_0_AssumpOccMFirstOccurrence_I3_J,axiom,
ord_less_nat @ occM2 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_0_AssumpOccMFirstOccurrence_I3_J) ).
thf(fact_62_le__less__Suc__eq,axiom,
! [X19: nat,X4: nat] :
( ( ord_less_eq_nat @ X19 @ X4 )
=> ( ( ord_less_nat @ X4 @ ( suc @ X19 ) )
<=> ( X4 = X19 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_62_le__less__Suc__eq) ).
thf(fact_31_Suc__le__D,axiom,
! [X4: nat,X21: nat] :
( ( ord_less_eq_nat @ ( suc @ X4 ) @ X21 )
=> ? [X22: nat] :
( X21
= ( suc @ X22 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_31_Suc__le__D) ).
thf(fact_68_not__less__eq__eq,axiom,
! [X19: nat,X4: nat] :
( ~ ( ord_less_eq_nat @ X19 @ X4 )
<=> ( ord_less_eq_nat @ ( suc @ X4 ) @ X19 ) ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_68_not__less__eq__eq) ).
thf(fact_1__092_060open_062length_A_Ife_Aindex_J_A_N_A1_A_092_060le_062_AOccM_092_060close_062,axiom,
ord_less_eq_nat @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) @ occM2,
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_1__092_060open_062length_A_Ife_Aindex_J_A_N_A1_A_092_060le_062_AOccM_092_060close_062) ).
thf(fact_24_diff__Suc__1,axiom,
! [X4: nat] :
( ( minus_minus_nat @ ( suc @ X4 ) @ one_one_nat )
= X4 ),
file('/export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p',fact_24_diff__Suc__1) ).
thf(c_0_9,plain,
! [X19: nat,X4: nat] :
( ~ ( ord_less_nat @ X19 @ X4 )
<=> ( ord_less_nat @ X4 @ ( suc @ X19 ) ) ),
inference(fof_simplification,[status(thm)],[fact_53_not__less__eq]) ).
thf(c_0_10,plain,
! [X1159: nat,X1160: nat] :
( ( ( ord_less_nat @ X1159 @ X1160 )
| ( ord_less_nat @ X1160 @ ( suc @ X1159 ) ) )
& ( ~ ( ord_less_nat @ X1160 @ ( suc @ X1159 ) )
| ~ ( ord_less_nat @ X1159 @ X1160 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
thf(c_0_11,plain,
! [X210: nat,X211: nat] :
( ~ ( ord_less_eq_nat @ X210 @ X211 )
=> ( ord_less_nat @ X211 @ X210 ) ),
inference(fof_simplification,[status(thm)],[fact_200_not__le__imp__less]) ).
thf(c_0_12,negated_conjecture,
( occM2
!= ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_13,plain,
! [X2: nat,X1: nat] :
( ~ ( ord_less_nat @ X1 @ ( suc @ X2 ) )
| ~ ( ord_less_nat @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
ord_less_nat @ occM2 @ ( size_s1406904903t_unit @ ( fe @ index ) ),
inference(split_conjunct,[status(thm)],[fact_0_AssumpOccMFirstOccurrence_I3_J]) ).
thf(c_0_15,plain,
! [X1071: nat,X1072: nat] :
( ( ord_less_eq_nat @ X1071 @ X1072 )
| ( ord_less_nat @ X1072 @ X1071 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
thf(c_0_16,plain,
! [X924: nat,X925: nat] :
( ( ~ ( ord_less_nat @ X925 @ ( suc @ X924 ) )
| ( X925 = X924 )
| ~ ( ord_less_eq_nat @ X924 @ X925 ) )
& ( ( X925 != X924 )
| ( ord_less_nat @ X925 @ ( suc @ X924 ) )
| ~ ( ord_less_eq_nat @ X924 @ X925 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_62_le__less__Suc__eq])])])]) ).
thf(c_0_17,negated_conjecture,
( occM2
!= ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_18,plain,
! [X897: nat,X898: nat] :
( ~ ( ord_less_eq_nat @ ( suc @ X897 ) @ X898 )
| ( X898
= ( suc @ ( esk9_2 @ X897 @ X898 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_31_Suc__le__D])])])]) ).
thf(c_0_19,plain,
~ ( ord_less_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ ( suc @ occM2 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_20,plain,
! [X2: nat,X1: nat] :
( ( ord_less_eq_nat @ X1 @ X2 )
| ( ord_less_nat @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_21,plain,
! [X19: nat,X4: nat] :
( ~ ( ord_less_eq_nat @ X19 @ X4 )
<=> ( ord_less_eq_nat @ ( suc @ X4 ) @ X19 ) ),
inference(fof_simplification,[status(thm)],[fact_68_not__less__eq__eq]) ).
thf(c_0_22,plain,
! [X2: nat,X1: nat] :
( ( X1 = X2 )
| ~ ( ord_less_nat @ X1 @ ( suc @ X2 ) )
| ~ ( ord_less_eq_nat @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_23,plain,
ord_less_eq_nat @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) @ occM2,
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062length_A_Ife_Aindex_J_A_N_A1_A_092_060le_062_AOccM_092_060close_062]) ).
thf(c_0_24,negated_conjecture,
( occM2
!= ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,plain,
! [X808: nat] :
( ( minus_minus_nat @ ( suc @ X808 ) @ one_one_nat )
= X808 ),
inference(variable_rename,[status(thm)],[fact_24_diff__Suc__1]) ).
thf(c_0_26,plain,
! [X1: nat,X2: nat] :
( ( X2
= ( suc @ ( esk9_2 @ X1 @ X2 ) ) )
| ~ ( ord_less_eq_nat @ ( suc @ X1 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_27,plain,
ord_less_eq_nat @ ( suc @ occM2 ) @ ( size_s1406904903t_unit @ ( fe @ index ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_28,plain,
! [X928: nat,X929: nat] :
( ( ( ord_less_eq_nat @ X928 @ X929 )
| ( ord_less_eq_nat @ ( suc @ X929 ) @ X928 ) )
& ( ~ ( ord_less_eq_nat @ ( suc @ X929 ) @ X928 )
| ~ ( ord_less_eq_nat @ X928 @ X929 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
thf(c_0_29,plain,
~ ( ord_less_nat @ occM2 @ ( suc @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
thf(c_0_30,plain,
! [X1: nat] :
( ( minus_minus_nat @ ( suc @ X1 ) @ one_one_nat )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
( ( suc @ ( esk9_2 @ occM2 @ ( size_s1406904903t_unit @ ( fe @ index ) ) ) )
= ( size_s1406904903t_unit @ ( fe @ index ) ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_32,plain,
! [X2: nat,X1: nat] :
( ~ ( ord_less_eq_nat @ ( suc @ X1 ) @ X2 )
| ~ ( ord_less_eq_nat @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,plain,
ord_less_eq_nat @ ( suc @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ) @ occM2,
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
thf(c_0_34,plain,
( ( esk9_2 @ occM2 @ ( size_s1406904903t_unit @ ( fe @ index ) ) )
= ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
~ ( ord_less_eq_nat @ ( suc @ occM2 ) @ ( suc @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_36,plain,
( ( suc @ ( minus_minus_nat @ ( size_s1406904903t_unit @ ( fe @ index ) ) @ one_one_nat ) )
= ( size_s1406904903t_unit @ ( fe @ index ) ) ),
inference(rw,[status(thm)],[c_0_31,c_0_34]) ).
thf(c_0_37,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : ITP061^1 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.17/0.37 % Computer : n015.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Fri May 3 13:04:36 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.24/0.53 Running higher-order theorem proving
% 0.24/0.53 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.0Q6akukubr/E---3.1_24345.p
% 0.38/0.63 # Version: 3.1.0-ho
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting new_ho_10 with 1500s (5) cores
% 0.38/0.63 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_6 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_9 with 300s (1) cores
% 0.38/0.63 # full_lambda_9 with pid 24426 completed with status 0
% 0.38/0.63 # Result found by full_lambda_9
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting new_ho_10 with 1500s (5) cores
% 0.38/0.63 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_6 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_9 with 300s (1) cores
% 0.38/0.63 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.38/0.63 # Search class: HGHSM-FSLM32-DHFFFSBC
% 0.38/0.63 # partial match(1): HGHSM-FSLM32-MHFFFSBC
% 0.38/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.63 # Starting additional_ho_6 with 163s (1) cores
% 0.38/0.63 # additional_ho_6 with pid 24428 completed with status 0
% 0.38/0.63 # Result found by additional_ho_6
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting new_ho_10 with 1500s (5) cores
% 0.38/0.63 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_6 with 300s (1) cores
% 0.38/0.63 # Starting full_lambda_9 with 300s (1) cores
% 0.38/0.63 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.38/0.63 # Search class: HGHSM-FSLM32-DHFFFSBC
% 0.38/0.63 # partial match(1): HGHSM-FSLM32-MHFFFSBC
% 0.38/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.63 # Starting additional_ho_6 with 163s (1) cores
% 0.38/0.63 # Preprocessing time : 0.007 s
% 0.38/0.63 # Presaturation interreduction done
% 0.38/0.63
% 0.38/0.63 # Proof found!
% 0.38/0.63 # SZS status Theorem
% 0.38/0.63 # SZS output start CNFRefutation
% See solution above
% 0.38/0.63 # Parsed axioms : 274
% 0.38/0.63 # Removed by relevancy pruning/SinE : 45
% 0.38/0.63 # Initial clauses : 409
% 0.38/0.63 # Removed in clause preprocessing : 16
% 0.38/0.63 # Initial clauses in saturation : 393
% 0.38/0.63 # Processed clauses : 592
% 0.38/0.63 # ...of these trivial : 9
% 0.38/0.63 # ...subsumed : 166
% 0.38/0.63 # ...remaining for further processing : 417
% 0.38/0.63 # Other redundant clauses eliminated : 34
% 0.38/0.63 # Clauses deleted for lack of memory : 0
% 0.38/0.63 # Backward-subsumed : 1
% 0.38/0.63 # Backward-rewritten : 7
% 0.38/0.63 # Generated clauses : 703
% 0.38/0.63 # ...of the previous two non-redundant : 584
% 0.38/0.63 # ...aggressively subsumed : 0
% 0.38/0.63 # Contextual simplify-reflections : 3
% 0.38/0.63 # Paramodulations : 659
% 0.38/0.63 # Factorizations : 2
% 0.38/0.63 # NegExts : 0
% 0.38/0.63 # Equation resolutions : 35
% 0.38/0.63 # Disequality decompositions : 0
% 0.38/0.63 # Total rewrite steps : 121
% 0.38/0.63 # ...of those cached : 81
% 0.38/0.63 # Propositional unsat checks : 0
% 0.38/0.63 # Propositional check models : 0
% 0.38/0.63 # Propositional check unsatisfiable : 0
% 0.38/0.63 # Propositional clauses : 0
% 0.38/0.63 # Propositional clauses after purity: 0
% 0.38/0.63 # Propositional unsat core size : 0
% 0.38/0.63 # Propositional preprocessing time : 0.000
% 0.38/0.63 # Propositional encoding time : 0.000
% 0.38/0.63 # Propositional solver time : 0.000
% 0.38/0.63 # Success case prop preproc time : 0.000
% 0.38/0.63 # Success case prop encoding time : 0.000
% 0.38/0.63 # Success case prop solver time : 0.000
% 0.38/0.63 # Current number of processed clauses : 139
% 0.38/0.63 # Positive orientable unit clauses : 50
% 0.38/0.63 # Positive unorientable unit clauses: 0
% 0.38/0.63 # Negative unit clauses : 31
% 0.38/0.63 # Non-unit-clauses : 58
% 0.38/0.63 # Current number of unprocessed clauses: 620
% 0.38/0.63 # ...number of literals in the above : 1332
% 0.38/0.63 # Current number of archived formulas : 0
% 0.38/0.63 # Current number of archived clauses : 244
% 0.38/0.63 # Clause-clause subsumption calls (NU) : 9913
% 0.38/0.63 # Rec. Clause-clause subsumption calls : 6365
% 0.38/0.63 # Non-unit clause-clause subsumptions : 128
% 0.38/0.63 # Unit Clause-clause subsumption calls : 76
% 0.38/0.63 # Rewrite failures with RHS unbound : 0
% 0.38/0.63 # BW rewrite match attempts : 22
% 0.38/0.63 # BW rewrite match successes : 7
% 0.38/0.63 # Condensation attempts : 0
% 0.38/0.63 # Condensation successes : 0
% 0.38/0.63 # Termbank termtop insertions : 47508
% 0.38/0.63 # Search garbage collected termcells : 9027
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.073 s
% 0.38/0.63 # System time : 0.007 s
% 0.38/0.63 # Total time : 0.080 s
% 0.38/0.63 # Maximum resident set size: 3764 pages
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.081 s
% 0.38/0.63 # System time : 0.009 s
% 0.38/0.63 # Total time : 0.091 s
% 0.38/0.63 # Maximum resident set size: 2232 pages
% 0.38/0.63 % E---3.1 exiting
% 0.38/0.63 % E exiting
%------------------------------------------------------------------------------